A new constrained filtering method based on Unscented Kalman Filter (UKF) and pseudo-observation called SPUKF (Sub-system Parallel Unscented Kalman Filter) was proposed for state estimation of nonlinear system with nonlinear constraints. In the proposed method, the system and constraint equations were fictitiously divided and reconstructed into two sub-systems, and then the state estimation was obtained from two concurrent filtering processes which were established on these two sub-systems alternately. Compared to sequential processing method of pseudo-measurement, SPUKF did not need to determine the processing order between measurement and constraint, but achieved better performances, so as to address the problem of deciding processing order beforehand in sequential processing method. In the simulation of pendulum motion, it is verified that SPUKF gets better estimation performance and less running time than the two forms of sequential processing method, and enhances the estimation error improvement ratio by 22 percentage points than UKF. Furthermore, it obtains comparable estimation results with batch processing way.

Aiming at the problem that the Peak-to-Average Power Ratio (PAPR) is too high and the complexity of the traditional suppression method is too high for the Filter Bank MultiCarrier/Offset Quadrature Amplitude Modulation (FBMC-OQAM) system, a new method of suppressing in FBMC-OQAM system was proposed. Firstly, based on the traditional Partial Transmit Sequence (PTS) method, the system characteristics have been improved, the Iterative PTS (IPTS) algorithm was obtained, which complexity was significantly lower than that of the traditional PTS algorithm. Secondly, the IPTS algorithm and the Clipping algorithm were used as a new IPTS-Clipping joint algorithm in FBMC-OQAM system. The FBMC signal was processed by the IPTS algorithm and then the clipping method was used to further suppress the PAPR of the system. The results of theoretical analysis and simulation show that compared with the traditional PTS algorithm, the proposed algorithm reduces the number of calculations by about 70%. When the cumulative distribution function CCDF reaches 10 ^-3, the PAPR value of the proposed algorithm is 48.5%, lower than that of the original signal, and 33% lower than that of PTS. The suppression effect is obviously better than other methods. The proposed algorithm not only can significantly suppress the PAPR of FBMC system, but also has much lower complexity than other original algorithms.

Hierarchical routing algorithm is now a hotspot in the field of wireless sensor network. Aiming at the problem that the energy of sensor nodes are limited, a hierarchical routing algorithm for wireless sensor networks based on small world model (HASWNM) was proposed. The Wireless Sensor Network (WSN) could reflect characteristics of the small world by adding nodes with high performance as well as shortcuts among cluster heads. As the energy consumption was mainly concentrated in the data transmission phase, the energy of the cluster head was taken into account while choosing the relay node between clusters. Besides, the different adaptive search area was determined according to the distance between the cluster head and the base station. The experimental results showed that the network can show the characteristics of small world when the number of high-performance nodes reached 100, and compared to the algorithms of CSWN (topology Control based on Small World Network), TSWN (Tree-based Small World Network), DASM (Directed Angulation towards the Sink node Model), the number of death rounds of the first node was delayed by 6%,6%,29% separately, and the average energy consumption of the network per round was reduced by 5%,12%,17% respectively. Thus the wireless sensor network constructed by the proposed algorithm has the characteristics of small world and low energy consumption.

Concerning the difficulty of its similarity to the expression and the effects of noise in medical image retrieval, a diffusion-based approach on a tensor product graph was proposed to improve the texton-based pairwise similarity metric by context information of other database objects. Firstly, medical image features were described and extracted by texton-based statistical method, and then the pairwise similarities were obtained with weights determined by the similarities between textons. A global similarity metric was achieved by utilizing the tensor product graph to propagate the similarity information along the intrinsic structure of the data manifold. Experimental results of ImageCLEFmed 2009 database show that, the proposed algorithm improves the performance by an average class accuracy of 32% and 19% compared with the Gabor-based retrieval algorithm and the Scale-Invariant Feature Transform (SIFT)-based retrieval algorithm respectively, which can be applied to medical image retrieval.

A Novel Quantum Differential Evolutionary (NQDE) algorithm was proposed for the Blocking Flowshop Scheduling Problem (BFSP) to minimize the makespan. The NQDE algorithm combined Quantum Evolutionary Algorithm (QEA) with Differential Evolution (DE) algorithm, and a novel quantum rotating gate was designed to control the evolutionary trend and increase the diversity of population. An effective Quantum-inspired Evolutionary Algorithm-Variable Neighborhood Search (QEA-VNS) co-evolutionary strategy was also developed to enhance the global search ability of the algorithm and to further improve the solution quality. The proposed algorithm was tested on the Taillard's benchmark instances, and the results show that the number of optimal solutions obtained by NQDE is bigger than the current better heuristic algorithm-Improved Nawaz-Enscore-Ham Heuristic (INEH) evidently. Specifically, the optimal solutions of 64 instances in the 110 instances are improved by NQDE. Moreover, the performance of NQDE is superior to the valid meta-heuristic algorithm-New Modified Shuffled Frog Leaping Algorithm (NMSFLA) and Hybrid Quantum DE (HQDE), and the Average Relative Percentage Deviation (ARPD) of NQDE algorithm decreases by 6% contrasted with the latter ones. So it is proved that NQDE algorithm is suitable for the large scale BFSP.

Since high-speed network traffic can not be effectively coped with the network traffic capture system implemented by software, and the multiple network flow need to be collected simultaneously to improve the capturing efficiency, an high-speed network flow capture framework in combination of hardware and software was presented, and the implementation of network traffic capture system based on NetFPGA-10G, called HSNTCS, was discussed. A variety of network flow in hardware was filtered and classified by the exact string matching engine and the regular expression matching engine of this system. After being transmitted to the corresponding data buffer at the driver layer, the network flow was directly copied to the corresponding database in user space. The experiments show that the throughput of UDP (User Datagram Protocol）and TCP (Transmission Control Protocol）in the high-speed network traffic capture system implemented by the hardware under the condition of exact string matching achieved 1.2Gb/s, which is about 3 times of that implemented by the software; and the throughput of UDP and TCP in the system implemented by the hardware under the condition of regular expression matching achieved 640Mb/s, which is about 3 times of that implemented by the software. The results demonstrate that the capture performance by the method of hardware is better than the method of software.

The advantages of hardware-based regular expressions matching were analyzed. At the same time, the basic ideas and methodology for Field Programmable Gate Array (FPGA)-based regular expressions matching were introduced. Furthermore, an algorithm classification approach was proposed in terms of two technical indicators: matching speed and resource utilization. The advantages, disadvantages and the basic ideas of various algorithms were summarized. Finally, the key techniques, difficulties and the future direction in this field were discussed.